ゲーム攻略・無料ウィキレンタルのアットウィキ (@WIKI)

約 3,716,592 件

xbox one 実績wiki@wiki - LEGO Marvel Super Heroes
https://w.atwiki.jp/xboxonescore/pages/24.html

LEGO Marvel Super Heroes 項目数：45 総ポイント：1000 難易度 XBOX360 実績解除スレまとめ @wiki http //www12.atwiki.jp/xbox360score/pages/2122.html 「Don t I Know You?」の解除に2コンが必須。 Sand Central Station Completed Level 1 - Sand Central Station 20 Times Square Off Completed Level 2 - Times Square Off 20 Exploratory Laboratory Completed Level 3 - Exploratory Laboratory 20 Rock up at the Lock up Completed Level 4 - Rock up at the Lock up 20 Rebooted, Resuited Completed Level 5 - Rebooted, Resuited 20 Red Head Detention Completed Level 6 - Red Head Detention 20 Bifrosty Reception Completed Level 7 - Bifrosty Reception 20 Juggernauts and Crosses Completed Level 8 - Juggernauts and Crosses 20 Doctor in the House Completed Level 9 - Doctor in the House 20 That Sinking Feeling Completed Level 10 - That Sinking Feeling 20 Taking Liberties Completed Level 11 - Taking Liberties 20 Rapturous Rise Completed Level 12 - Rapturous Rise 20 Magnetic Personality Completed Level 13 - Magnetic Personality 20 A Doom with a View Completed Level 14 - A Doom with a View 20 The Good, the Bad and the Hungry Completed Level 15 - The Good, the Bad and the Hungry 20 Falling... with Style Complete first Helicarrier skydive 20 Don t I Know You? Teamed up Captain America with Human Torch (Co-op) 20 Stan-tastic Rescued Stan Lee from every peril (Single Player) 30 Road Rage Destroyed 100 vehicles in the Manhattan hub 20 It s Clobberin Time! Defeated 100 enemies as the Thing 20 I m Always Angry! Transformed into the Hulk 50 times 20 Billionaire Philanthropist Collected 1,000,000,000 studs (Single Player) 40 This Is fantastic! Turned Mister Fantastic into a teapot for the first time 20 You Win a No-Prize! Completed game 100% (Single Player) 40 Avengers Assembled Collected all Avengers characters in the game (Single Player) 50 Sinister Six Collected Doc Ock, Sandman, Mysterio, Kraven the Hunter, Electro and Vulture (Single Player) 20 To Me, My X-Men Collected all traditionally heroic mutants (Single Player) 20 Brotherhood Collected all traditionally evil mutants (Single Player) 20 I Am Iron Man Collected all Iron Man armors (Single Player) 20 Stan s Soapbox Turned into Stan Hulk 20 Post-Credit Party Completed House Party Protocol 50 The Toast of Croydon Created a character called “Trevor” in the character customizer 20 Puny God Performed Hulk s special move on Loki 20 Welcome to Level 7 Played as Agent Coulson 20 It s Me Time! Read a comic in Deadpool s room on the Helicarrier 20 Bad Luck? Unlocked Black Cat (Single Player) 20 Zoo Believer Unlocked all animal-themed characters (Single Player) 30 Guardians of the Galaxy Unlocked all the Guardians of the Galaxy (Single Player) 20 Fastball Special Performed a special throwing move as Colossus on Wolverine 20 Menace of Magneto Drove to the Baxter Building as Magneto in the Magneto Mobile 20 Alter Ego Performed all big LEGO figure transformations 20 Can t Hurt Me Bub Regenerated as Wolverine 10 Cosplay Created a custom character 20 Ultimate True Believer Unlocked all True Believers (Single Player) 20 Really? Collected Howard the Duck (Single Player) 10
OpenGLプログラミングメモ - なぜOpenGLを使うのか？
https://w.atwiki.jp/opengl/pages/14.html

なぜ、DirectXではなくOpenGLなのか？最新のグラフィックス、最速の描画を行うのであれば間違いなくDirectXがベストですが、 3Dを勉強したい、ころころ変わるDirectXにはついて行けないという方、いろんなOSでシェーダーモデル5.0を使いたいという方にはOpenGLをおススメします。 OpenGL 4.0 OpenGL4.0を駆使すれば、MacOSやLinux、Windows XP、Vista、7、8の4世代のWindowsに渡って DirectX 11世代のシェーダーモデル5.0を使う事ができます。 DirectXより簡単当サイト管理人の感想ですが、DirectXに比べてOpenGLは割と簡単な印象を受けます。業界標準となる可能性 OpenGLが右手座標系、DirectXが左手座標系を採用しているのは大きな明暗。数学やほとんどの3Dアプリでは右手座標系を使用しています。 ODEやOpenALなども、そうです。つまり右手座標系が業界標準だったのです。最近ではDirectXも左手座標系と右手座標系を選べるようになったのですが、統一されていないのは混乱を招く種です。また、OpenGLはプレイステーション1,2,3、iphoneアプリなどのSDKとして採用されています。 C/C++を使う理由言うまでもなく、豊富な各種ライブラリと過去の遺産を無駄にする事なくプログラミングするためです。実行速度という点では、アセンブラに劣るでしょうが、VisualC++の場合、 MASMがインラインアセンブラで使えます。 GUIに関してはC#、VisualBasic、JAVA + Swingに、分があるように感じるかもしれませんが、.NET Frameworkでしたら、C++/CLIを用いる事でC#と同等の GUIができます。さらに、C++/CLIの言語仕様もJAVAのような完全なオブジェクト指向ではないため、オブジェクトが存在しなかった時の例外処理等を記述しなくても良く、非常に楽をする事ができます。 C#で追加されたガベージコレクションやファイナライザといった機能も併せ持っている上に、単純に同じようなアプリケーションを作成した場合、C#製の物よりも C++/CLI製の.NETアプリの方が速いようです。つまり、現時点でWindows環境下において、究極の開発言語という事になります。 freeglutを使う理由これも言うまでもなく、圧倒的にプログラムコード量を減らし楽をするためです。また、単純にOpenGLの使い方を覚える点で面倒な初期化関連やウインドウの作成などの手間を省くためです。「こんなに簡単にOpenGLプログラミングできるんだ」という事を体験するには freeglutが1番適していると思ったからです。 var so = new SWFObject( http //chuka-tube.com/wp-content/themes/141210_pc/jw/player.swf , mpl , 426 , 320 , 9 ); so.addParam( allowfullscreen , true ); so.addParam( allowscriptaccess , always ); so.addParam( wmode , opaque ); so.addVariable( file , http //dd.yinyuetai.com/uploads/videos/common/F25901494A27F1964FD2A25634ABD357.mp4?sc=dac1ced33549d3a4 ); so.addVariable( image , http //img.chuka-tube.com/music/26/2164508.jpg ); so.addVariable( provider , http ); so.addVariable( autostart , false ); so.addVariable( backcolor , EEEEEE ); so.addVariable( frontcolor , 666666 ); so.addVariable( lightcolor , 888888 ); so.addVariable( screencolor , 000000 ); so.addVariable( volume , 100 ); so.write( mediaspace );
プログラム倉庫 - hyop
https://w.atwiki.jp/ce00582/pages/887.html

Function check(s1 As Single, th1, th2, n As Single, c, y1, y2, x, h As Single) As Single Dim ch As Single Dim s2 As Single Dim c1 As Single Dim x1 As Single Dim x2 As Single Dim u1 As Single ch = 0 For s2 = 1 To 9 c1 = c(s1, s2) + x(s1, s2, 1, n) * h x1 = y1(s1, s2) + x(s1, s2, 2, n) * h x2 = y2(s1, s2) + x(s1, s2, 3, n) * h u1 = u(s1, s2, th1, th2, c1, x1, x2) c1 = c(s1, s2 + 1) + x(s1, s2 + 1, 1, n) * h x1 = y1(s1, s2 + 1) + x(s1, s2 + 1, 2, n) * h x2 = y2(s1, s2 + 1) + x(s1, s2 + 1, 3, n) * h u2 = u(s1, s2, th1, th2, c1, x1, x2) If u2 u1 Then ch = ch + 10 Next check = ch End Function Function bcount(s1 As Single, n As Single, x) As Single Dim sum1 As Single Dim s2 As Single sum1 = 0 For s2 = 1 To 10 sum1 = sum1 + x(s1, s2, 1, n) - x(s1, s2, 2, n) - x(s1, s2, 3, n) Next bcount = sum1 End Function Function u(s1 As Single, s2 As Single, th1, th2, cp As Single, yp1 As Single, yp2 As Single) As Single Dim lx As Single Dim cx As Single Dim px As Single l1 = yp1 / th1(s1) l2 = yp2 / th2(s2) cx = cp px = 0 If cx 0.01 Then px = 1 If l1 0.99 Then px = 1 If l2 0.99 Then px = 1 If px = 1 Then cx = 0.5 If px = 1 Then l1 = 0.5 If px = 1 Then l2 = 0.5 ux = Log(cx) + Log(1 - l1) + Log(1 - l2) If px = 1 Then ux = -999 u = ux End Function Private Sub Command1_Click() Dim s2 As Single Dim m As Single Dim th1(1 To 100) As Single Dim th2(1 To 100) As Single Dim y1(1 To 10, 1 To 10) As Single Dim y2(1 To 10, 1 To 10) As Single Dim c(1 To 10, 1 To 10) As Single Dim x(1 To 10, 1 To 10, 1 To 3, 0 To 10) As Single Dim gu(1 To 10, 0 To 10) As Single Dim v(1 To 10, 0 To 10) As Single Dim goton(1 To 10, 0 To 10) As Single Dim s1 As Single Dim rank As Single Dim s As Single Dim r1 As Single Dim x1 As Single Dim c1 As Single Dim x2 As Single Dim t2 As Single Dim n As Single Dim h As Single Dim op(1 To 10) As Single Dim vs As Single For s = 1 To 10 th1(s) = 0.2 * s th2(s) = 0.1 * s Next Open "c /lupin.txt" For Input As #2 Do Until EOF(2) Input #2, a1, a2, a3, a4, a5 s1 = a1 s2 = a2 c(s1, s2) = a3 y1(s1, s2) = a4 y2(s1, s2) = a5 Loop Close #2 t3 = 0 Do Until t3 10 For s1 = 1 To 10 For n = 1 To 10 t2 = 0 Do Until t2 100 t1 = 0 Do Until t1 100 For s2 = 1 To 10 For rank = 1 To 3 Randomize r1 = Rnd() x1 = 0 If r1 0.7 Then x1 = 1 If r1 0.3 Then x1 = -1 x(s1, s2, rank, n) = x1 Next Next If bcount(s1, n, x) = 0 Then t1 = 1000 t1 = t1 + 1 Loop h = 0.001 ch = check(s1, th1, th2, n, c, y1, y2, x, h) If ch 10 Then t2 = 1000 t2 = t2 + 1 Loop Next Next For s1 = 1 To 10 For n = 0 To 10 u1 = 0 For s2 = 1 To 10 c1 = c(s1, s2) + x(s1, s2, 1, n) * h x1 = y1(s1, s2) + x(s1, s2, 2, n) * h x2 = y2(s1, s2) + x(s1, s2, 3, n) * h u1 = u1 + u(s1, s2, th1, th2, c1, x1, x2) Next gu(s1, n) = u1 Next Next s1 = 1 For n = 0 To 10 v(s1, n) = gu(s1, n) Next For s1 = 2 To 10 For n = 0 To 10 vs = -999 For p = 0 To 10 de = 0 For s2 = 1 To 10 c1 = c(s1, s2) + x(s1, s2, 1, n) * h x1 = y1(s1, s2) + x(s1, s2, 2, n) * h x2 = y2(s1, s2) + x(s1, s2, 3, n) * h u1 = u(s1, s2, th1, th2, c1, x1, x2) For n2 = 1 To 10 c1 = c(s1 - 1, n2) + x(s1 - 1, n2, 1, p) * h x1 = y1(s1 - 1, n2) + x(s1 - 1, n2, 2, p) * h x2 = y2(s1 - 1, n2) + x(s1 - 1, n2, 3, p) * h u2 = u(s1, s2, th1, th2, c1, x1, x2) If u2 u1 Then de = de + 10 Next Next v1 = gu(s1, n) + v(s1 - 1, p) If de 5 Then v1 = -999 If v1 vs Then nx = p If v1 vs Then vs = v1 Next v(s1, n) = vs goton(s1, n) = nx Next Next s1 = 10 maxv = -999 For n = 0 To 10 If v(s1, n) maxv Then nx = n If v(s1, n) maxv Then maxv = v(s1, n) Next op(10) = nx For j = 1 To 9 s1 = 11 - j op(s1 - 1) = goton(s1, op(s1)) Next For s1 = 1 To 10 For s2 = 1 To 10 c(s1, s2) = c(s1, s2) + x(s1, s2, 1, op(s1)) * h y1(s1, s2) = y1(s1, s2) + x(s1, s2, 2, op(s1)) * h y2(s1, s2) = y2(s1, s2) + x(s1, s2, 3, op(s1)) * h Next Next e = 0 For s1 = 1 To 10 e = e + op(s1) ^ 2 Next Debug.Print t3, e, maxv t3 = t3 + 1 Loop For s1 = 1 To 10 For s2 = 1 To 10 Debug.Print c(s1, s2), y1(s1, s2), y2(s1, s2) Next Next End Sub
XBOX360 実績解除スレまとめ @wiki - LEGO Harry Potter: YEARS 1-4
https://w.atwiki.jp/xbox360score/pages/1063.html

LEGO Harry Potter YEARS 1-4 項目数：36 総ポイント：1000 難易度：★★☆☆☆ 実績コンプまでの所要時間は30～40時間．チートコード使用による実績解除への影響は無し．従来のLEGOシリーズ同様にとにかく収集物の数が膨大、特にStudents in PerilはExtraによる探索対象外であるため各自でメモ推奨。 cheatコード一覧 http //www.ign.com/cheats/games/lego-harry-potter-years-1-4-wii-14329935 Junior Complete Year One Story Levels 50 Senior Complete Year Two Story Levels 50 Prefect Complete Year Three Story Levels 50 Head Boy Complete Year Four Story Levels 50 Teacher s pet Complete All Story Lessons (Single Player Only) 70 Story Complete! Complete the Story Levels in all four years 70 Crest Collector Collect all of the house crests in Year 1 (Single Player Only) 30 Crest Fanatic Collect all of the house crests in Year 2 (Single Player Only) 30 Ultra Collector Collect all of the house crests in Year 3 (Single Player Only) 30 The Ultimate Collector Collect all of the house crests in Year 4 (Single Player Only) 30 Power Up! Collect all of the Red Bricks (Single Player Only) 45 The Bonus Level is Yours Collect all of the Gold Bricks (Single Player Only) 70 Student Rescue Rescue all students in peril (Single Player Only) 45 Stud Magnet Get True Wizard in every level (Single Player Only) 30 You re the Best Complete the game to 100% (Single Player Only) 70 Dark Wizards Buy every version of Voldemort (Quirrell/Tom Riddle/Voldemort) (Single Player Only) 10 Quidditch Team Buy the entire Gryffindor Quidditch team from Book One (Single Player Only) 10 Back in Time Use the Time-Turner 10 Building Blocks Complete all the LEGO Builder tutorial levels (Single Player Only) 30 Good Dog Defeat 20 enemies with Fang 10 Wonderful Weasleys Buy the entire Weasley family (Single Player Only) 10 Quirrell Quandary Defeat Quirrell in the Quirrell boss fight, using Voldemort 15 Multiplier Collect 10 million studs in one level (Single Player Only) 10 Arachnophobic Defeat 20 spiders with Ron 10 Chilled out Freeze 20 characters using Glacius 10 Boo! Scare 20 students using a ghost character 10 Animagus Unlock all Animagi (Single Player Only) 10 Defeating the Object Defeat the mountain troll, using Quirrell 15 Watch Out! Knock over ten characters using a ride-able object 15 Solid Snape Hide in a barrel as Snape 15 Role Reversal Defeat Harry (as Voldemort), in the Graveyard 15 Quiet Please! Turn the sound and music down to 0 in the options menu whilst in the library 15 Muggle Trouble Defeat 10 enemies with a Muggle character 15 Lumos Solem Destroy 50 Devil s Snare plants 15 Quick Quidditch Complete the Quidditch level within five minutes 15 Ghostly Treasure Collect 500 ghost studs 15 ●The Bonus Level is Yours(Gold Brickを200個すべて集める) バグあり。clock towerにてGold Brickを手に入れる前にRed Brickを手に入れると、Gold Brickが手に入らなくなる。このバグに会うと、この実績はもちろんYou re the Best、Quirrell Quandaryなども解除できなくなる。従ってclock towerでは先にGold Brickを手に入れること。 ●You re the Best ゲーム中スタートボタンで表示される進捗率が100%になると解除．下記項目を満たせばOK． Year1～4の全24レベルをクリアフリープレイモードでストーリモード全24レベルを再プレイ ※収集物を回収するだけなのでレベルをクリアする必要は無い。全ストーリレッスンを完了全ボーナスレベルとチュートリアルを完了 Gold Bricksを200個収集 Red Bricksを20個収集（チートコードによる補完可能) Students in Perilを50人救助 character tokenを全て収集しストアで全キャラクターを購入 House Crestsを24個完成（クレストの欠片は24×4=96個) ストアで全スペルを購入 ●Building Blocks LEGO Builderのチュートリアル4つを全て完了すると解除．チュートリアルはGringotts Bankでプレイ可能 ●Quirrell Quandary 操作キャラをVoldemortにしてYear1-6ボスを倒すことで解除 VoldemortはGold Bricks200個コンプ後、Knockturn Alleyの奥にある店から入れるレベルをクリア後アンロックされる。 ●Multiplier 1つのレベルプレイ中に10,000,000個のstudsを回収で解除．チートコード or Red BricksによるStuds倍率ボーナスの併用可能． ●Arachnophobic 操作キャラはRon，2-5のボスでクモが無限湧きするため簡単に解除可能． ●Defeating the Object 操作キャラはQuirrellで1-2ラストのトロルを倒すと解除． ●Solid Snape 操作キャラはSnapeで1-1開始直後のストリートにある樽に隠れることで解除。 ●Role Reversal 操作キャラをLord Voldemort、2P側はハリーにして、4-6の最初の庭園を抜け、墓地でスペル"Avada Kedavra"を使いハリーを倒すと解除。Avada Kedavraは緑色のドクロマークアイコンのスペル。 ●Quiet Please! ホグワーツ内図書館でオプションメニューからサウンドとミュージックボリュームを0に設定すると解除． ●Muggle Trouble Station GuardやMilkman、犬など、直接攻撃しか出来ないキャラクターで敵を10体倒すと解除。 ●Quick Quidditch Year1 "A Jinxed Broom"を5分以内にクリアすることで解除．フリープレイで収集物を無視すれば簡単に解除可能． ●Ghostly Treasure 道案内してくれる幽霊キャラが落とす半透明のstudsを500個集めると解除．この実績のみストーリモード終了後に解除不可能となるため注意．ただし意識しなくてもYear2前後で自然と解除されるレベル． ●コレクタブル系 Lego Harry Potter - Collectables Guide Lego Harry Potter Years 1-4 Collectibles Guide ※ホグワーツのマップが掲載されているので、収集ガイドと併用すると便利。オプションメニューのExtraにある各種Detectorが助けとなるものの数が莫大、前述の通りStudents in PerilはDetectorが対応していないため、ホグワーツ内で救出できる26人については個別でのメモを推奨。 ●Quidditch Team 該当するのはOliver Wood、Angelina Johnson、Katie Bell、Alicia Spinnet、Fred Weasley、George Weasley、およびHarry Potterである。解除するにはQuidditch Teamバージョンのみの購入でよい。条件を満たしても解除されない報告あり。
Metal Meta-Metabolome Project - Metabolic pathway analysis 2
https://w.atwiki.jp/metalmetabo/pages/26.html

- visitors Combining pathway analysis with flux balance analysis for the comprehensive study of metabolic systems slu.edu [PDF]… JS Edwards, D Letscher, BØ Palsson - Biotechnology and …, 2000 - interscience.wiley.com http //scholar.google.com/scholar?q=related HtFdZ3DFTgMJ scholar.google.com/ hl=ja as_sdt=2000 ... dimensional space. From metabolic pathway analysis, the edges of the high-dimensional flux cone are vectors that correspond to sys- temically defined “extreme pathways” spanning the ca- pabilities of the system. The addition ... Metabolic pathway analysis of yeast strengthens the bridge between transcriptomics and metabolic networks T Çakir, B Kirdar, KÖ Ülgen - Biotechnology and …, 2004 - Wiley Online Library http //scholar.google.com/scholar?q=related cUtrabByB40J scholar.google.com/ hl=ja as_sdt=2000 Abstract Central carbon metabolism of the yeast Saccha- romyces cerevisiae was analyzed using metabolic pathway analysis tools. Elementary flux modes for three substrates (glucose, galactose, and ethanol) were determined using the catabolic reactions ... Metabolic pathway analysis for rational design of L-methionine production by Escherichia coli and Corynebacterium glutamicum JO Krömer, C Wittmann, H Schröder, E Heinzle - Metabolic engineering, 2006 - Elsevier http //scholar.google.com/scholar?q=related KSxlsQoF_oIJ scholar.google.com/ hl=ja as_sdt=2000 Metabolic pathway analysis was carried out to predict the metabolic potential of Corynebacterium glutamicum and Escherichia coli for the production of L-methionine. Based on detailed stoichiometric models for these organisms, this allowed the calculation of the theoretically optimal ... The genome-scale metabolic extreme pathway structure in Haemophilus influenzae shows significant network redundancy JA Papin, ND Price, JS Edwards, BØ … - Journal of theoretical …, 2002 - Elsevier http //scholar.google.com/scholar?q=related KrUkw9kndisJ scholar.google.com/ hl=ja as_sdt=2000 ... 229–248. Abstract | PDF (428 K) | View Record in Scopus | Cited By in Scopus (198). 19. CHSCHILLING, S. SCHUSTER, BO PALSSON and R. HEINRICH, Metabolic pathway analysis basic concepts and scientific applications in the post-genomic era. Biotechnol. Prog. ... Potential drug targets in Mycobacterium tuberculosis through metabolic pathway analysis psu.edu [PDF]S Anishetty, M Pulimi, G Pennathur - Computational Biology and …, 2005 - Elsevier http //scholar.google.com/scholar?q=related hEJbAmAPhwkJ scholar.google.com/ hl=ja as_sdt=2000 The emergence of multidrug resistant varieties of Mycobacterium tuberculosis has led to a search for novel drug targets. We have performed an insilico comparative analysis of metabolic pathways of the host Homo sapiens and the pathogen M. tuberculosis. Enzymes from the ... In silico metabolic pathway analysis and design succinic acid production by metabolically engineered Escherichia coli as an example jsbi.org [PDF]SY Lee, SH Hong, SY Moon - GENOME INFORMATICS SERIES, 2002 - jsbi.org http //scholar.google.com/scholar?q=related 6Ehoy39R1HUJ scholar.google.com/ hl=ja as_sdt=2000 Abstract The intracellular metabolic fluxes can be calculated by metabolic flux analysis, which uses a stoichiometric model for the intracellular reactions along with mass balances around the intra- cellular metabolites. In this study, we have constructed in silico metabolic pathway ... Determination of redundancy and systems properties of the metabolic network of Helicobacter pylori using genome-scale extreme pathway analysis cshlp.org [HTML]ND Price, JA Papin, BØ Palsson - Genome Research, 2002 - genome.cshlp.org http //scholar.google.com/scholar?q=related hyQpOmehsTYJ scholar.google.com/ hl=ja as_sdt=2000 Metabolic pathway analysis in trypanosomes and malaria parasites. nih.gov [PDF]AH Fairlamb - Philosophical Transactions of the Royal Society B …, 2002 - ncbi.nlm.nih.gov http //scholar.google.com/scholar?q=related x44FtcJTlQwJ scholar.google.com/ hl=ja as_sdt=2000 Identification of novel drug targets is required for the development of new classes of drugs to overcome drug resistance and replace less efficacious treatments. In theory, knowledge of the entire genome of a pathogen identifies every potential drug target in any given microbe. ... A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks uni-erlangen.de [PDF]S Schuster, DA Fell, T Dandekar - Nature biotechnology, 2000 - nature.com http //scholar.google.com/scholar?q=related 4GmcRTKIXlwJ scholar.google.com/ hl=ja as_sdt=2000 ... Trends Biotechnol. 17, 53–60(1999). | Article | PubMed | ISI | ChemPort |; Schilling, CH, Schuster, S., Palsson, BO Heinrich R. Metabolic pathway analysis basic concepts and scientific applications in the post-genomic era. Biotechnol. Prog. 15, 296–303 (1999). ...
akbdata @ ウィキ - doubleglass
https://w.atwiki.jp/akbdata/pages/994.html

所属事務所 https //jpop.co.jp 花島大義和田春読みハナジマヒロヨシワダハル生年月日 1976年2月29日出身宮城県仙台市 Wikipedia 和田春提供リスト 2016年11月30日二人セゾン（欅坂46 3rd single）共作曲誰よりも高く跳べ！（けやき坂46） 2019年5月29日 Sing Out!（乃木坂46 23rd single）作曲編曲曖昧 2019年7月17日ドレミソラシド（日向坂46 2nd single）作曲編曲 My god J-POP
HSP研究所 - stop-command
https://w.atwiki.jp/btrsgk/pages/34.html

l
tanaka_lol @ ウィキ - jungle考察
https://w.atwiki.jp/tanaka_lol/pages/14.html

メリットデメリット具体的には JungleMAP なぜjunglingが必要なのか？まずjunglingでできることを整理してみる。メリット序盤から中盤にかけてのjunglingするとduo laneより早くlvlが上がる。 jungleに行くことによってsolo laneが二つできて味方全体のlvlが早く上がる敵に視界を取られてないのでプレッシャーをかけることができるどのレーンにもgangにいけるどのレーンのカバーもできる早いタイミングでドラゴンやバロンを倒すことができるレーンにいるとつらいチャンプが安全に稼げる早い段階でワードを買えるデメリット 2vs1のレーンができてしまう可能性がある jungle潰しにあってしまう可能性がある 2vs1はできるチャンプとできないチャンプがいるので選択の幅が狭くなるしかし、基本的に2vs1できるチャンプは強いので問題ないだろう。 jungle潰しに関してだが、jungleを潰しに来てる敵も成長が遅れてるので倒されない限りそこまで問題は無いだろう。具体的には gangが成功してタワーを割り切ることもできるかもしれないし、味方がきつくてリコールしてレーンに誰もいなくなってもカバーに入れば経験値やお金を無駄にしなくてすむそもそもjungling自体も自陣の資源を無駄にしないためである序盤でレーンから離れてしまうとlvlの上がりが遅くなるが、中立クリープのリスポンを待ってる間にワードをおきにいける（マップコントロールができる） gang性能が高いチャンピョンがgangする時間が増える。 solo jungle duo lane lvlの上がり方はといった感じ。 2vs1ができるチャンプがいて、duo laneより早くlvlが上がって、マップコントロールができて、gangができて、カバーができてもはややらない理由が無いのではないだろうか。よくjunglerのgangに期待する人がいるが、rammus xin shaco 等のgang専門のjunglerでない限りjungleが遅くなってしまうので過度な期待はしないようにしよう。 gangにいけるjunglerはある程度スピードが速いか、gangが強いかのどちらか。 WW fiddle等はjungleを狩ってもヘルスがあまり減らずに、クリープの沸きが暇なのでgangいける。 amumu trynd popppy等レーンよりjungleの方が安全に稼げるが、スピードもヘルスもきついチャンプはlvl6になってからじゃないとgangがつらい。そもそもgangが必要なレーン配置はnoobってことですね。 JungleMAP
プログラム倉庫 - tougo
https://w.atwiki.jp/ce00582/pages/900.html

Function myeselect(s1 As Single, s2 As Single, th1, th2, n1 As Single, n2 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m1 = 0 To 10 c1 = c(m1, 9, n1) my = y1(m1) fy = y2(9) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 If u1 maxu Then maxu = u1 Next For m1 = 0 To 10 c1 = c(m1, 10, n2) my = y1(m1) fy = y2(10) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 If u1 maxu Then maxu = u1 Next myeselect = maxm End Function Function myfselect(s1 As Single, s2 As Single, th1, th2, n1 As Single, n2 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m1 = 0 To 10 c1 = c(m1, 0, n1) my = y1(m1) fy = y2(0) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 If u1 maxu Then maxu = u1 Next For m1 = 0 To 10 c1 = c(m1, 1, n2) my = y1(m1) fy = y2(1) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 If u1 maxu Then maxu = u1 Next myfselect = maxm End Function Function fyfselect(s1 As Single, s2 As Single, th1, th2, n1 As Single, n2 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m1 = 0 To 10 c1 = c(m1, 0, n1) my = y1(m1) fy = y2(0) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = 0 If u1 maxu Then maxu = u1 Next For m1 = 0 To 10 c1 = c(m1, 1, n2) my = y1(m1) fy = y2(1) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = 1 If u1 maxu Then maxu = u1 Next fyfselect = maxm End Function Function fyeselect(s1 As Single, s2 As Single, th1, th2, n1 As Single, n2 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m1 = 0 To 10 c1 = c(m1, 9, n1) my = y1(m1) fy = y2(9) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = 9 If u1 maxu Then maxu = u1 Next For m1 = 0 To 10 c1 = c(m1, 10, n2) my = y1(m1) fy = y2(10) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = 10 If u1 maxu Then maxu = u1 Next fyeselect = maxm End Function Function fprefer(s1 As Single, s2 As Single, th1, th2, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single maxu = -999 For m1 = 0 To 10 For m2 = 0 To 10 c1 = c(m1, m2) my = y1(m1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 If u1 maxu Then maxu = u1 Next Next fprefer = maxm End Function Function fyselect(s1 As Single, s2 As Single, th1, th2, m2 As Single, n1 As Single, n2 As Single, n3 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m1 = 0 To 10 c1 = c(m1, m2 - 1, n1) my = y1(m1) fy = y2(m2 - 1) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 - 1 If u1 maxu Then maxu = u1 Next For m1 = 0 To 10 c1 = c(m1, m2, n2) my = y1(m1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 If u1 maxu Then maxu = u1 Next For m1 = 0 To 10 c1 = c(m1, m2 + 1, n3) my = y1(m1) fy = y2(m2 + 1) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 + 1 If u1 maxu Then maxu = u1 Next fyselect = maxm End Function Function myselect(s1 As Single, s2 As Single, th1, th2, m2 As Single, n1 As Single, n2 As Single, n3 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m1 = 0 To 10 c1 = c(m1, m2 - 1, n1) my = y1(m1) fy = y2(m2 - 1) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 If u1 maxu Then maxu = u1 Next For m1 = 0 To 10 c1 = c(m1, m2, n2) my = y1(m1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 If u1 maxu Then maxu = u1 Next For m1 = 0 To 10 c1 = c(m1, m2 + 1, n3) my = y1(m1) fy = y2(m2 + 1) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 If u1 maxu Then maxu = u1 Next myselect = maxm End Function Function mfselect(s1 As Single, s2 As Single, th1, th2, n1 As Single, n2 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m2 = 0 To 10 c1 = c(0, m2, n1) my = y1(0) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = 0 If u1 maxu Then maxu = u1 Next For m2 = 0 To 10 c1 = c(1, m2, n2) my = y1(1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = 1 If u1 maxu Then maxu = u1 Next mfselect = maxm End Function Function meselect(s1 As Single, s2 As Single, th1, th2, n1 As Single, n2 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m2 = 0 To 10 c1 = c(9, m2, n1) my = y1(9) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = 9 If u1 maxu Then maxu = u1 Next For m2 = 0 To 10 c1 = c(10, m2, n2) my = y1(10) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = 10 If u1 maxu Then maxu = u1 Next meselect = maxm End Function Function feselect(s1 As Single, s2 As Single, th1, th2, n1 As Single, n2 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m2 = 0 To 10 c1 = c(9, m2, n1) my = y1(9) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 If u1 maxu Then maxu = u1 Next For m2 = 0 To 10 c1 = c(10, m2, n2) my = y1(10) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 If u1 maxu Then maxu = u1 Next feselect = maxm End Function Function ffselect(s1 As Single, s2 As Single, th1, th2, n1 As Single, n2 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m2 = 0 To 10 c1 = c(0, m2, n1) my = y1(0) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 If u1 maxu Then maxu = u1 Next For m2 = 0 To 10 c1 = c(1, m2, n2) my = y1(1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 If u1 maxu Then maxu = u1 Next ffselect = maxm End Function Function u(s1 As Single, s2 As Single, th1, th2, cp As Single, yp1 As Single, yp2 As Single) As Single Dim lx As Single Dim cx As Single Dim px As Single l1 = yp1 / th1(s1) l2 = yp2 / th2(s2) cx = cp px = 0 If cx 0.01 Then px = 1 If l1 0.99 Then px = 1 If l2 0.99 Then px = 1 If l1 0 Then px = 1 If l2 0 Then px = 1 If px = 1 Then cx = 0.5 If px = 1 Then l1 = 0.5 If px = 1 Then l2 = 0.5 ux = Log(cx) + Log(1 - l1) + Log(1 - l2) If px = 1 Then ux = -999 u = ux End Function Function fselect(s1 As Single, s2 As Single, th1, th2, m1 As Single, n1 As Single, n2 As Single, n3 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m2 = 0 To 10 c1 = c(m1 - 1, m2, n1) my = y1(m1 - 1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 If u1 maxu Then maxu = u1 Next For m2 = 0 To 10 c1 = c(m1, m2, n2) my = y1(m1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 If u1 maxu Then maxu = u1 Next For m2 = 0 To 10 c1 = c(m1, m2, n3) my = y1(m1 + 1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m2 If u1 maxu Then maxu = u1 Next fselect = maxm End Function Function mselect(s1 As Single, s2 As Single, th1, th2, m1 As Single, n1 As Single, n2 As Single, n3 As Single, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single Dim i As Single Dim j As Single maxu = -999 For m2 = 0 To 10 c1 = c(m1 - 1, m2, n1) my = y1(m1 - 1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 - 1 If u1 maxu Then maxu = u1 Next For m2 = 0 To 10 c1 = c(m1, m2, n2) my = y1(m1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 If u1 maxu Then maxu = u1 Next For m2 = 0 To 10 c1 = c(m1, m2, n3) my = y1(m1 + 1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 + 1 If u1 maxu Then maxu = u1 Next mselect = maxm End Function Function mprefer(s1 As Single, s2 As Single, th1, th2, c, y1, y2) As Single Dim m As Single Dim maxu As Single Dim maxm As Single Dim u1 As Single Dim c1 As Single Dim my As Single Dim fy As Single maxu = -999 For m1 = 0 To 10 For m2 = 0 To 10 c1 = c(m1, m2) my = y1(m1) fy = y2(m2) u1 = u(s1, s2, th1, th2, c1, my, fy) If u1 maxu Then maxm = m1 If u1 maxu Then maxu = u1 Next Next mprefer = maxm End Function Private Sub Command1_Click() Dim m1 As Single Dim m2 As Single Dim s1 As Single Dim s2 As Single Dim cp1 As Single Dim yp1 As Single Dim yp2 As Single Dim c(0 To 10, 0 To 10, -1 To 1) As Single Dim cs(0 To 10, 0 To 10) As Single Dim th1(1 To 10) As Single Dim th2(1 To 10) As Single Dim y1(0 To 10) As Single Dim y2(0 To 10) As Single Dim mgr(1 To 10, 1 To 10) As Single Dim fgr(1 To 10, 1 To 10) As Single Dim gu(1 To 9, -1 To 1, -1 To 1, -1 To 1) As Single Dim gb(1 To 9, -1 To 1, -1 To 1, -1 To 1) As Single Dim endu(-1 To 1, -1 To 1) As Single Dim fastb(-1 To 1, -1 To 1) As Single Dim endb(-1 To 1, -1 To 1) As Single Dim fastu(-1 To 1, -1 To 1) As Single Dim mgroup(0 To 10, 1 To 100) As Single Dim fgroup(0 To 10, 1 To 100) As Single Dim ngroup(0 To 10) As Single Dim v(0 To 9, -1 To 1, -1 To 1, -50 To 50) As Single Dim goton(0 To 9, -1 To 1, -1 To 1, -50 To 50) As Single Dim gotoq(0 To 9, -1 To 1, -1 To 1, -50 To 50) As Single Dim endv(-1 To 1, -1 To 1, -50 To 50) As Single Dim endq(-1 To 1, -1 To 1, -50 To 50) As Single Dim op(0 To 10) As Single Dim oq(0 To 10) As Single Dim i As Single Dim j As Single Dim h As Single Dim n1 As Single Dim n2 As Single Dim n3 As Single Open "c /lupin.txt" For Input As #2 Do Until EOF(2) Input #2, a1, a2, a3 m1 = a1 m2 = a2 cs(m1, m2) = a3 Loop Close #2 For s = 1 To 10 th1(s) = 0.2 * s th2(s) = 0.1 * s Next For m = 0 To 10 y1(m) = 0.105 * m y2(m) = 0.05 * m Next t3 = 0 Do Until t3 5 h = 0.001 t1 = 0 Do Until t1 10 For m2 = 0 To 10 For s1 = 1 To 10 For s2 = 1 To 10 mgr(s1, s2) = mprefer(s1, s2, th1, th2, cs, y1, y2) fgr(s1, s2) = fprefer(s1, s2, th1, th2, cs, y1, y2) Next Next Next For m1 = 0 To 10 n = 0 For s1 = 1 To 10 For s2 = 1 To 10 If mgr(s1, s2) = m1 Then n = n + 1 If mgr(s1, s2) = m1 Then mgroup(m1, n) = s1 If mgr(s1, s2) = m1 Then fgroup(m1, n) = s2 Next Next ngroup(m1) = n Next For m1 = 0 To 10 For m2 = 0 To 10 For n = -1 To 1 c(m1, m2, n) = cs(m1, m2) + n * h Next Next Next For m1 = 1 To 9 For n1 = -1 To 1 For n2 = -1 To 1 For n3 = -1 To 1 nu = ngroup(m1) us = 0 bs = 0 For s = 1 To nu s1 = mgroup(m1, s) s2 = fgroup(m1, s) i = mselect(s1, s2, th1, th2, m1, n1, n2, n3, c, y1, y2) j = fselect(s1, s2, th1, th2, m1, n1, n2, n3, c, y1, y2) nx = n2 If i = m1 - 1 Then nx = n1 If i = m1 + 1 Then nx = n3 cp1 = c(i, j, nx) yp1 = y1(i) yp2 = y2(j) u1 = u(s1, s2, th1, th2, cp1, yp1, yp2) us = us + u1 bs = bs + yp1 + yp2 - cp1 Next gu(m1, n1, n2, n3) = us gb(m1, n1, n2, n3) = bs Next Next Next Next For n1 = -1 To 1 For n2 = -1 To 1 nu = ngroup(0) us = 0 bs = 0 For s = 1 To nu s1 = mgroup(0, s) s2 = fgroup(0, s) i = mfselect(s1, s2, th1, th2, n1, n2, c, y1, y2) j = ffselect(s1, s2, th1, th2, n1, n2, c, y1, y2) nx = n1 If i = 1 Then nx = n2 cp1 = c(i, j, nx) yp1 = y1(i) yp2 = y2(j) u1 = u(s1, s2, th1, th2, cp1, yp1, yp2) us = us + u1 bs = bs + yp1 + yp2 - cp1 Next fastu(n1, n2) = us fastb(n1, n2) = bs Next Next For n1 = -1 To 1 For n2 = -1 To 1 nu = ngroup(10) us = 0 bs = 0 For s = 1 To nu s1 = mgroup(10, s) s2 = fgroup(10, s) i = meselect(s1, s2, th1, th2, n1, n2, c, y1, y2) j = feselect(s1, s2, th1, th2, n1, n2, c, y1, y2) nx = n2 If i = 9 Then nx = n1 cp1 = c(i, j, nx) yp1 = y1(i) yp2 = y2(j) u1 = u(s1, s2, th1, th2, cp1, yp1, yp2) us = us + u1 bs = bs + yp1 + yp2 - cp1 Next endu(n1, n2) = us endb(n1, n2) = bs Next Next For n1 = -1 To 1 For n2 = -1 To 1 For q = -50 To 50 v(0, n1, n2, q) = -999 Next Next Next For n1 = -1 To 1 For n2 = -1 To 1 q0 = fastb(0, 0) q1 = fastb(n1, n2) q = Int((q1 - q0) / h) pp = 0 If q 50 Then pp = 1 If q -50 Then pp = 1 If pp = 1 Then q = 0 v(0, n1, n2, q) = fastu(n1, n2) If pp = 1 Then v(0, n1, n2, q) = -999 Next Next For m1 = 1 To 9 For n1 = -1 To 1 For n2 = -1 To 1 For q = -50 To 50 vs = -999 For nx = -1 To 1 u1 = gu(m1, nx, n1, n2) q0 = gb(m1, 0, 0, 0) q1 = gb(m1, nx, n1, n2) qq = Int((q1 - q0) / h) qx = q - qq pp = 0 If qx 50 Then pp = 1 If qx -50 Then pp = 1 If pp = 1 Then qx = 0 v1 = u1 + v(m1 - 1, nx, n1, qx) If pp = 1 Then v1 = -999 If v1 vs Then nxs = nx If v1 vs Then qxs = qx If v1 vs Then vs = v1 Next v(m1, n1, n2, q) = vs goton(m1, n1, n2, q) = nxs gotoq(m1, n1, n2, q) = qxs Next Next Next Next For n1 = -1 To 1 For n2 = -1 To 1 For q = -50 To 50 u1 = endu(n1, n2) q0 = endb(0, 0) q1 = endb(n1, n2) qq = Int((q1 - q0) / h) qx = q - qq pp = 0 If qx 50 Then pp = 1 If qx -50 Then pp = 1 If pp = 1 Then qx = 0 v1 = u1 + v(9, n1, n2, qx) If pp = 1 Then v1 = -999 endv(n1, n2, q) = v1 endq(n1, n2, q) = qx Next Next Next maxv = -999 For n1 = -1 To 1 For n2 = -1 To 1 For q = 0 To 50 If endv(n1, n2, q) maxv Then nx1 = n1 If endv(n1, n2, q) maxv Then nx2 = n2 If endv(n1, n2, q) maxv Then qx = q If endv(n1, n2, q) maxv Then maxv = endv(n1, n2, q) Next Next Next op(9) = nx1 op(10) = nx2 oq(10) = qx oq(9) = endq(op(9), op(10), oq(10)) For j = 1 To 9 m1 = 9 - j op(m1) = goton(m1 + 1, op(m1 + 1), op(m1 + 2), oq(m1 + 1)) oq(m1) = gotoq(m1 + 1, op(m1 + 1), op(m1 + 2), oq(m1 + 1)) Next For m1 = 0 To 10 For m2 = 0 To 10 cs(m1, m2) = c(m1, m2, op(m1)) Next Next e = 0 For m1 = 0 To 9 e = e + op(m1) ^ 2 Next If e 2 Then h = h / 2 If h 10 ^ (-5) Then t1 = 1000 Debug.Print t1, e, maxv t1 = t1 + 1 Loop h = 0.001 t2 = 0 Do Until t2 10 For s1 = 1 To 10 For s2 = 1 To 10 mgr(s1, s2) = mprefer(s1, s2, th1, th2, cs, y1, y2) fgr(s1, s2) = fprefer(s1, s2, th1, th2, cs, y1, y2) Next Next For m2 = 0 To 10 n = 0 For s1 = 1 To 10 For s2 = 1 To 10 If fgr(s1, s2) = m2 Then n = n + 1 If fgr(s1, s2) = m2 Then mgroup(m2, n) = s1 If fgr(s1, s2) = m2 Then fgroup(m2, n) = s2 Next Next ngroup(m2) = n Next For m1 = 0 To 10 For m2 = 0 To 10 For n = -1 To 1 c(m1, m2, n) = cs(m1, m2) + n * h Next Next Next For m2 = 1 To 9 For n1 = -1 To 1 For n2 = -1 To 1 For n3 = -1 To 1 nu = ngroup(m2) us = 0 bs = 0 For s = 1 To nu s1 = mgroup(m2, s) s2 = fgroup(m2, s) i = myselect(s1, s2, th1, th2, m2, n1, n2, n3, c, y1, y2) j = fyselect(s1, s2, th1, th2, m2, n1, n2, n3, c, y1, y2) nx = n2 If j = m2 - 1 Then nx = n1 If j = m2 + 1 Then nx = n3 cp1 = c(i, j, nx) yp1 = y1(i) yp2 = y2(j) u1 = u(s1, s2, th1, th2, cp1, yp1, yp2) us = us + u1 bs = bs + yp1 + yp2 - cp1 Next gu(m2, n1, n2, n3) = us gb(m2, n1, n2, n3) = bs Next Next Next Next For n1 = -1 To 1 For n2 = -1 To 1 nu = ngroup(0) us = 0 bs = 0 For s = 1 To nu s1 = mgroup(0, s) s2 = fgroup(0, s) i = myfselect(s1, s2, th1, th2, n1, n2, c, y1, y2) j = fyfselect(s1, s2, th1, th2, n1, n2, c, y1, y2) nx = n1 If j = 1 Then nx = n2 cp1 = c(i, j, nx) yp1 = y1(i) yp2 = y2(j) u1 = u(s1, s2, th1, th2, cp1, yp1, yp2) us = us + u1 bs = bs + yp1 + yp2 - cp1 Next fastu(n1, n2) = us fastb(n1, n2) = bs Next Next For n1 = -1 To 1 For n2 = -1 To 1 nu = ngroup(10) us = 0 bs = 0 For s = 1 To nu s1 = mgroup(10, s) s2 = fgroup(10, s) i = myeselect(s1, s2, th1, th2, n1, n2, c, y1, y2) j = fyeselect(s1, s2, th1, th2, n1, n2, c, y1, y2) nx = n2 If j = 9 Then nx = n1 cp1 = c(i, j, nx) yp1 = y1(i) yp2 = y2(j) u1 = u(s1, s2, th1, th2, cp1, yp1, yp2) us = us + u1 bs = bs + yp1 + yp2 - cp1 Next endu(n1, n2) = us endb(n1, n2) = bs Next Next For n1 = -1 To 1 For n2 = -1 To 1 For q = -50 To 50 v(0, n1, n2, q) = -999 Next Next Next For n1 = -1 To 1 For n2 = -1 To 1 q0 = fastb(0, 0) q1 = fastb(n1, n2) q = Int((q1 - q0) / h) pp = 0 If q 50 Then pp = 1 If q -50 Then pp = 1 If pp = 1 Then q = 0 v(0, n1, n2, q) = fastu(n1, n2) If pp = 1 Then v(0, n1, n2, q) = -999 Next Next For m2 = 1 To 9 For n1 = -1 To 1 For n2 = -1 To 1 For q = -50 To 50 vs = -999 For nx = -1 To 1 u1 = gu(m2, nx, n1, n2) q0 = gb(m2, 0, 0, 0) q1 = gb(m2, nx, n1, n2) qq = Int((q1 - q0) / h) qx = q - qq pp = 0 If qx 50 Then pp = 1 If qx -50 Then pp = 1 If pp = 1 Then qx = 0 v1 = u1 + v(m2 - 1, nx, n1, qx) If pp = 1 Then v1 = -999 If v1 vs Then nxs = nx If v1 vs Then qxs = qx If v1 vs Then vs = v1 Next v(m2, n1, n2, q) = vs goton(m2, n1, n2, q) = nxs gotoq(m2, n1, n2, q) = qxs Next Next Next Next For n1 = -1 To 1 For n2 = -1 To 1 For q = -50 To 50 u1 = endu(n1, n2) q0 = endb(0, 0) q1 = endb(n1, n2) qq = Int((q1 - q0) / h) qx = q - qq pp = 0 If qx 50 Then pp = 1 If qx -50 Then pp = 1 If pp = 1 Then qx = 0 v1 = u1 + v(9, n1, n2, qx) If pp = 1 Then v1 = -999 endv(n1, n2, q) = v1 endq(n1, n2, q) = qx Next Next Next maxv = -999 For n1 = -1 To 1 For n2 = -1 To 1 For q = 0 To 50 If endv(n1, n2, q) maxv Then nx1 = n1 If endv(n1, n2, q) maxv Then nx2 = n2 If endv(n1, n2, q) maxv Then qx = q If endv(n1, n2, q) maxv Then maxv = endv(n1, n2, q) Next Next Next op(9) = nx1 op(10) = nx2 oq(10) = qx oq(9) = endq(op(9), op(10), oq(10)) For j = 1 To 9 m2 = 9 - j op(m2) = goton(m2 + 1, op(m2 + 1), op(m2 + 2), oq(m2 + 1)) oq(m2) = gotoq(m2 + 1, op(m2 + 1), op(m2 + 2), oq(m2 + 1)) Next For m1 = 0 To 10 For m2 = 0 To 10 cs(m1, m2) = c(m1, m2, op(m2)) Next Next e = 0 For m2 = 0 To 9 e = e + op(m2) ^ 2 Next If e 3 Then h = h / 2 If h 10 ^ (-5) Then t2 = 1000 Debug.Print t2, e, maxv t2 = t2 + 1 Loop t3 = t3 + 1 Loop End Sub
THE ROLLING STONES ARCHIVES WEBSITE - 1967 Live & Broadcasts
https://w.atwiki.jp/stones/pages/67.html

■Sunday Night at the London Palladium (A Rolling Stones Vinyl Product), 1-22-67 london. Live vocals on pre-recorded backing track (prepared January 18/19, 1967). Controversial performance. Connection Ruby Tuesday It s All Over Now Let s Spend the Night Together (SBD) (1CDR transferred from 1LP) ■Still I m Gonna Miss You (Outsider Bird Records OBR 93003) (7 single) Live at Stadthalle, Vienna, Austria, April 2, 1967 (2nd show) More ■Brian We Miss You (Magic Dwarf Records MDR-5), poor sound quality. (1CDR transferred from 1LP) Live at Stadthalle, Vienna, Austria, April 2, 1967 (2nd show) ■Fuckin Suckin (The Amazing Pig TAP 010-PRO), 4-11-67 L Olympia, Paris show More. Broadcast by Europe 1 French Radio Musicorama Not very good sound quality. (1CD transferred from 1LP) ■A L Olympia 1967 (Magic Dwarf Records MDR-4) (1CD transferred from 1LP) Live at L Olympia, Paris, France, April 11, 1967 (SBD) More BACK / NEXT

1 … 98 99 100